An algorithm for indefinite integer quadratic programming
نویسندگان
چکیده
منابع مشابه
An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملAn Evolutionary Algorithm for Integer Programming
The mutation distribution of evolutionary algorithms usu ally is oriented at the type of the search space Typical examples are binomial distributions for binary strings in genetic algorithms or normal distributions for real valued vectors in evolution strategies and evolu tionary programming This paper is devoted to the construction of a mutation distribution for unbounded integer search spaces...
متن کاملAn Indefinite - Quadratic - Programming Model Fora Continuous - Production Problem
A model is presented for a problem of scheduling the lengths of N production periods on one machine, which will manufacture q products. The problem is to choose production periods so as to minimize the sum of inventory costs for the q products in the presence of given demands. Mathematically, the problem is one of minimizing an indefinite quadratic function subject to linear constraints. A nume...
متن کاملAn Algorithm for Large-Scale Quadratic Programming
We are particularly concerned in solving (1.1) when n is large and the vectors a, and matrix H are sparse. We do not restrict H to being positive (semi-)definite and consequently are content with finding local solutions to (1.1). Of course, for many classes of problem, it is known a priori that any local solution is a global one. Our method is fundamentally related to that proposed by Fletcher ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90164-y